On the mutual-exclusion problem — a quest for minimal solutions

On the Mutual-Exclusion Problem - A Quest for Minimal Solutions

A Study on the Distributed k-Mutual Exclusion Problem

The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes can enter a critical section at a time in a distributed system. The distributed 1-mutual exclusion problem is one of fundamental distributed problems in distributed systems and many algorithms for solving the problem have been proposed. In this paper, we introduce the k-coterie as an extension of ...

Myths About the Mutual Exclusion Problem

Recently in these pages appeared a report by Doran and Thomas [2] which gave partially simplified versions of Dekker-like solutions to the two process mutual exclusion problem with busy-waiting. This report presents a truly simple solution to the problem and attempts in a small way to dispel some myths that seem to have arisen concerning the problem. Briefly, the mutual exclusion problem for tw...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract)

iire mutual exclusii?n problem in a distributed system, in which each process has a memory of i!s own, into whtch it has exclusive write privileges but from which others may read, is reconsidered. Symmt iric solutions are looked for. It is shown that, though no such solution may be deterministic, there are Probabilistic solutions. DiIferent solutions are provided for two processes. and then a s...